5

The edge-disjoint 3-hop-constrained paths polytope

Year:
2010
Language:
english
File:
PDF, 464 KB
english, 2010
10

Two node-disjoint hop-constrained survivable network design and polyhedra

Year:
2016
Language:
english
File:
PDF, 1.27 MB
english, 2016
12

What Do Teachers Need to Support English Learners?

Year:
2014
Language:
english
File:
PDF, 181 KB
english, 2014
18

A branch-and-cut algorithm for the k-edge connected subgraph problem

Year:
2010
Language:
english
File:
PDF, 301 KB
english, 2010
48

The separation problem of rounded capacity inequalities: Some polynomial cases

Year:
2017
Language:
english
File:
PDF, 935 KB
english, 2017
49

On the complexity of the separation problem for rounded capacity inequalities

Year:
2017
Language:
english
File:
PDF, 803 KB
english, 2017